Compiling SVM-Fortran for the Intel Paragon XP/S

نویسندگان

  • Rudolf Berrendorf
  • Michael Gerndt
چکیده

SVM-Fortran is a language designed t o program highly parallel systems with a global address space. A compiler for SVM-Fortran is described which generates code for parallel machines; our current target machine is the Intel Paragon X P / S with an SVMextension called ASVM. Performance numbers are given for applications and compared to results obtained with corresponding HPFversions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Benchmarking UHGROMOS

Porting of the parallel Fortran preprocessor, Pfortran, to Intel Corporation and IBM Corporation massively parallel processor machines is presented. The machines include the Intel iPSC/SSO, the Caltech Intel DELTA, the Intel Paragon, and the IBM SPl. The UHGROMOS molecular dynamics program, a version of GROMOS ported to parallel machines through the use of Pfortran, was used as a test applicati...

متن کامل

Passing Programming on a Finite Element Application

This paper describes the methods used and experiences made with implementing a nite element application on three diierent parallel computers with either message passing or shared virtual memory as the programming model. Designing a parallel nite element application using message-passing requires to nd a data domain decomposition to map data into the local memory of the processors. Since data ac...

متن کامل

Shared Virtual Memory and Message Passing Programming on a Finite Element Application

This paper describes the methods used and experiences made with implementing a nite element application on three diierent parallel computers with either message passing or shared virtual memory as the programming model. Designing a parallel nite element application using message-passing requires to nd a data domain decomposition to map data into the local memory of the processors. Since data ac...

متن کامل

On Experiments with a Parallel Direct Solver for Diagonally Dominant Banded Linear Systems

We report on numerical experiments that we conducted with a direct algorithm, the single width sparator algorithm, to solve diagonally dominant banded linear systems. With detailed estimations of computation and communication cost we quantitatively analyze their innuence on the parallel performance of the algorithm. We report on numerical experiments executed on an Intel Paragon XP/S-22MP.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004